翻訳と辞書 Words near each other ・ Variations on "I Got Rhythm" ・ Variations on "Là ci darem la mano" (Chopin) ・ Variations on a Blue Line ・ Variations on a Dream ・ Variations on a Korean Folk Song ・ Variations on A Love Supreme ・ Variations on a Nursery Tune (Dohnányi) ・ Variations on a Rococo Theme ・ Variations on a Theme ・ Variations on a Theme (David Thomas album) ・ Variations on a Theme (Om album) ・ Variations on a Theme by Haydn ・ Variations on a Theme by Tchaikovsky (Arensky) ・ Variable-length array ・ Variable-length buffer ・ Variable-length code ・ Variable-length intake manifold ・ Variable-length quantity ・ Variable-mass system ・ Variable-message sign ・ Variable-order Bayesian network ・ Variable-order Markov model ・ Variable-pitch propeller ・ Variable-position horizontal stabilizer ・ Variable-range hopping ・ Variable-Rate Multimode Wideband ・ Variable-speed air compressor ・ Variable-sweep wing ・ Variable-width encoding ・ Variables sampling plan Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Variable-length code ： ウィキペディア英語版 Variable-length code In coding theory a variable-length code is a code which maps source symbols to a ''variable'' number of bits. Variable-length codes can allow sources to be compressed and decompressed with ''zero'' error (lossless data compression) and still be read back symbol by symbol. With the right coding strategy an independent and identically-distributed source may be compressed almost arbitrarily close to its entropy. This is in contrast to fixed length coding methods, for which data compression is only possible for large blocks of data, and any compression beyond the logarithm of the total number of possibilities comes with a finite (though perhaps arbitrarily small) probability of failure. v Some examples of well-known variable-length coding strategies are Huffman coding, Lempel–Ziv coding and arithmetic coding. == Codes and their extensions == The extension of a code is the mapping of finite length source sequences to finite length bit strings, that is obtained by concatenating for each symbol of the source sequence the corresponding codeword produced by the original code. Using terms from formal language theory, the precise mathematical definition is as follows: Let $S$ and $T$ be two finite sets, called the source and target alphabets, respectively. A code $C:\; S\; \backslash to\; T^$ * is a total function mapping each symbol from $S$ to a sequence of symbols over $T$, and the extension of $C$ to a homomorphism of $S^$ * into $T^$ *, which naturally maps each sequence of source symbols to a sequence of target symbols, is referred to as its extension. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Variable-length code」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.